Balanced dynamic multiple travelling salesmen: Algorithms and continuous approximations

Dynamic routing occurs when customers are not known in advance, e.g. for real-time routing. Two heuristics proposed that solve the balanced dynamic multiple travelling salesmen problem (BD-mTSP). These represent operational (tactical) tools (online, real-time) Several types and scopes of dynamics proposed. Particular attention is given to sequential dynamics. The closest vehicle heuristic (BD-CVH) assignment (BD-AVH) applied this type algorithms a wide range test instances. Taxi services palette transfers warehouses demonstrate how use BD-mTSP real-world scenarios. Continuous approximation models BD-mTSP's derived serve as strategic express route lengths using vehicles, customers, without need running an algorithm. A machine learning approach was used obtain regression models. mean absolute percentage error two these below 3%.